The Matrix of a Slim Semimodular Lattice
نویسنده
چکیده
A finite lattice L is called slim if no three join-irreducible elements of L form an antichain. Slim semimodular lattices play the main role in G. Czédli and E.T. Schmidt [5], where lattice theory is applied to a purely group theoretical problem. Here we develop a unique matrix representation for these lattices.
منابع مشابه
Slim Semimodular Lattices. I. A Visual Approach
A finite lattice L is called slim if no three join-irreducible elements of L form an antichain. Slim lattices are planar. Slim semimodular lattices play the main role in [3], where lattice theory is applied to a purely group theoretical problem. After exploring some easy properties of slim lattices and slim semimodular lattices, we give two visual structure theorems for slim semimodular lattices.
متن کاملComposition Series in Groups and the Structure of Slim Semimodular Lattices
Let ~ H and ~ K be finite composition series of a group G. The intersections Hi ∩ Kj of their members form a lattice CSL( ~ H, ~ K) under set inclusion. Improving the Jordan-Hölder theorem, G. Grätzer, J.B. Nation and the present authors have recently shown that ~ H and ~ K determine a unique permutation π such that, for all i, the i-th factor of ~ H is “down-and-up projective” to the π(i)-th f...
متن کاملSlim Semimodular Lattices. II. A Description by Patchwork Systems
Rectangular lattices are special planar semimodular lattices introduced by G. Grätzer and E. Knapp in 2009. By a patch lattice we mean a rectangular lattice whose weak corners are coatoms. As a sort of gluings, we introduce the concept of a patchwork system. We prove that every glued sum indecomposable planar semimodular lattice is a patchwork of its maximal patch lattice intervals “sewn togeth...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملHow many ways can two composition series intersect?
Let ~ H and ~ K be finite composition series of length h in a group G. The intersections of their members form a lattice CSL( ~ H, ~ K) under set inclusion. Our main result determines the number N(h) of (isomorphism classes) of these lattices recursively. We also show that this number is asymptotically h!/2. If the members of ~ H and ~ K are considered constants, then there are exactly h! such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 29 شماره
صفحات -
تاریخ انتشار 2012